New Curry-Howard Terms for Full Linear Logic
نویسندگان
چکیده
In this paper we (1) provide a natural deduction system for full first-order linear logic, (2) introduce Curry-Howard-style terms for this version of linear logic, (3) prove strong normalization for the system, and (4). prove that given a proof of V~‘x3y a(.~, y) and any individual term t we can compute a term u such that a(t,u) is provable.
منابع مشابه
Curry-Howard Terms for Linear Logic
In this paper we 1. provide a natural deduction system for full rst-order linear logic, 2. introduce Curry{Howard{style terms for this version of linear logic, 3. extend the notion of substitution of Curry-Howard terms for term variables, 4. deene the reduction rules for the Curry{Howard terms and 5. outline a proof of the strong normalization for the full system of linear logic using a develop...
متن کاملThe Girard Translation Extended with Recursion
This paper extends Curry-Howard interpretations of Intuitionistic Logic (IL) and Intuitionistic Linear Logic (ILL) with rules for recursion. The resulting term languages, the λ-calculus and the linear λ-calculus respectively, are given sound categorical interpretations. The embedding of proofs of IL into proofs of ILL given by the Girard Translation is extended with the rules for recursion, suc...
متن کاملOn the Curry-Howard Interpretation of a Fragment of Classical Linear Logic with Subexponentials
We construct a partially-ordered hierarchy of delimited control operators similar to those of the CPS hierarchy of Danvy and Filinski [6]. However, instead of relying on nested CPS translations, these operators give directly a Curry-Howard interpretation of a fragment of linear logic extended with subexponentials, i.e., multiple pairs of ! and ?. We show how the fundamental problem of delimited...
متن کاملA Concurrent Model for Linear Logic
We build a realizability model for linear logic using a name-passing process calculus. The construction is based on testing semantics for processes, drawing ideas from spatial and modal logics, and yields a new type system for process calculi that ensures termination while allowing significantly concurrent behaviours. Then we study how embeddings of intuitionistic and classical logics into line...
متن کاملUnifying static and dynamic denotational semantics
This work deals with semantics of programming languages (or equivalently, thanks to Curry-Howard isomorphism, with semantics of proofs). We introduce a framework in which both static semantics (Ehrhard’s hypercoherences) and dynamic semantics (Hyland-Ong’s games), can be presented. The work is carried in a multiplicative subsystem of Laurent’s polarized linear logic with weakening. Like Böhm tr...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
- Theor. Comput. Sci.
دوره 185 شماره
صفحات -
تاریخ انتشار 1997